one-way permutation

См. также в других словарях:

• One-way function — Unsolved problems in computer science Do one way functions exist? In computer science, a one way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here easy and hard are to be… …   Wikipedia

• One-way compression function — In cryptography, a one way compression function is a function that transforms two fixed length inputs to an output of the same size as one of the inputs. The transformation is one way , meaning that it is difficult given a particular output to… …   Wikipedia

• Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… …   Wikipedia

• One-time pad — Excerpt from a one time pad In cryptography, the one time pad (OTP) is a type of encryption, which has been proven to be impossible to crack if used correctly. Each bit or character from the plaintext is encrypted by a modular addition with a bit …   Wikipedia

• Permutation City — infobox Book | name = Permutation City title orig = translator = image caption = Cover of first edition (hardcover) author = Greg Egan illustrator = cover artist = country = Australia language = English series = genre = Science fiction novel… …   Wikipedia

• Permutation (music) — In music, a permutation of a set is a transformation of its prime form by applying zero or more of certain operations , specifically transposition, inversion, and retrograde.The permutations resulting from applying the inversion or retrograde… …   Wikipedia

• Random permutation statistics — The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example,… …   Wikipedia

• Claw-free permutation — In mathematical and computer science field of cryptography, a group of three numbers (x,y,z) is said to be a claw of two permutations f0 and f1 if f0(x) = f1(y) = z. A pair of permutations f0 and f1 are said to be claw free if there is no… …   Wikipedia

• Variably Modified Permutation Composition — VMPC ( Variably Modified Permutation Composition ) is encryption technology designed by Bartosz Zoltak, publicly presented in 2004 at an international cryptography conference Fast Software Encryption in Delhi, India.The core of the technology is… …   Wikipedia

• Variably modified permutation composition — (VMPC) is an encryption technology designed by Bartosz Zoltak, publicly presented in 2004 at an international cryptography conference for Fast Software Encryption in Delhi, India.The core of the technology is the VMPC one way function, which is… …   Wikipedia

• Twelvefold way — In combinatorics, the twelvefold way is a name given to a systematic classification of 12 related enumerative problems concerning two finite sets, which include the classical problems of counting permutations, combinations, multisets, and… …   Wikipedia